On Possibilistic Automata
نویسنده
چکیده
General automata are considered with respect to normal-ization over semirings. Possibilistic automata are deened as normal pessimistic fuzzy automata. Possibilistic automata are analogous to stochas-tic automata where stochastic (+=) semirings are replaced by possi-bilistic (_=^) semirings; but where stochastic automata must be normal, fuzzy automata may be (resulting in possibilistic automata) or may not be (resulting in fuzzy automata proper). While possibilistic automata are direct generalizations of nondeterministic automata, stochastic automata are not. Some properties of possibilistic automata are considered, and the identity of possibilistic automata strongly consistent with stochastic automata is shown.
منابع مشابه
A New Combination of Robust-possibilistic Mathematical Programming for Resilient Supply Chain Network under Disruptions and Uncertainty: A Real Supply Chain (RESEARCH NOTE)
Nowadays, the design of a strategic supply chain network under disruption is one of the most important priorities of the governments. One of the strategic purposes of managers is to supply the sustainable agricultural products and food in stable conditions which require the production of soil nutrients. In this regard, some disruptions such as sanctions and natural disasters have a destructive ...
متن کاملCoalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-understood. The combination however is difficult, both for conceptual and technical reasons. Here we study the combination from a coalgebraic perspective and identify a monad CM that captures the combination—following wor...
متن کاملOn solving possibilistic multi- objective De Novo linear programming
Multi-objective De Novo linear programming (MODNLP) is problem for designing optimal system by reshaping the feasible set (Fiala [3] ). This paper deals with MODNLP having possibilistic objective functions coefficients. The problem is considered by inserting possibilistic data in the objective functions coefficients. The solution of the problem is defined and established under the using of effi...
متن کاملON SOMEWHAT FUZZY AUTOMATA CONTINUOUS FUNCTIONS IN FUZZY AUTOMATA TOPOLOGICAL SPACES
In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.
متن کاملA Model of Onion Routing with Provable Anonymity
Onion routing is a scheme for anonymous communication that is designed for practical use. It has not been modeled formally, however, and therefore its anonymity guarantees have not been rigorously analyzed. We give an IO-automata model of an onion-routing protocol and, under possibilistic definitions, characterize the situations in which anonymity and unlinkability are guaranteed.
متن کامل